#include<bits/stdc++.h>
using namespace std;

int n,ans;
vector<int>r;
int r2[100005];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    ans=n;
    for(int i=1;i<=n;i++)
        cin>>r2[i];
    sort(r2+1,r2+n+1);
    for(int i=1;i<=n;i++)
        r.push_back(r2[i]);
    for(int i=1;i<=n;i++){
        int k=r2[i];
        auto pos=upper_bound(r.begin(),r.end(),k);
        if(pos==r.end())break;
        r.erase(pos);
        ans--;
    }
    cout<<ans;
    return 0;
}
